A note on class one graphs with maximum degree six
نویسندگان
چکیده
منابع مشابه
Planar Graphs of Maximum Degree Six without 7-cycles are Class One
It is conjectured by Vizing (1965) that every planar graphs graph G with maximum degree 6 ⩽ ∆ ⩽ 7 is class one. The case ∆ = 7 was confirmed independently by Sanders and Zhao (2001), and by Zhang (2000). In this paper, we prove that every planar graph G with ∆ = 6 and without 7-cycles is class one.
متن کاملClass two 1-planar graphs with maximum degree six or seven
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this note we give examples of class two 1-planar graphs with maximum degree six or seven.
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملnote on degree kirchhoff index of graphs
the degree kirchhoff index of a connected graph $g$ is defined as the sum of the terms $d_i,d_j,r_{ij}$ over all pairs of vertices, where $d_i$ is the degree of the $i$-th vertex, and $r_{ij}$ the resistance distance between the $i$-th and $j$-th vertex of $g$. bounds for the degree kirchhoff index of the line and para-line graphs are determined. the special case of regular grap...
متن کاملA note on the degree sequences of graphs with restrictions
Degree sequences of some types of graphs will be studied and characterized in this paper.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2006
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.02.007